<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: Member List</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>bellman_ford Member List</h1>This is the complete list of members for <a class="el" href="a00002.html">bellman_ford</a>, including all inherited members.<p><table>
  <tr class="memlist"><td><a class="el" href="a00001.html#b79e1ddec2f2afdf4b36b10724db8b15">algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#4bad319b62ea978b6d008cec9e94b4bc">bellman_ford</a>()</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#9da2fb7d20ef1f726ee935474302d80b">check</a>(graph &amp;G)</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#30203c9433e4fb628e6d5d86e2c81d5c">distance</a>(const node &amp;n) const </td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">GTL_ERROR</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">GTL_OK</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#2dd5b35844eeb4ca3e57f42d57975ebe">negative_cycle</a>() const </td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#ec75a9280a8e108b59f5f0294e4bdff0">predecessor_edge</a>(const node &amp;n) const </td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#3122381284e811ef02b7061d383eecb7">predecessor_node</a>(const node &amp;n) const </td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#48fd2ed9748bdafeb61e5bb296ec67c6">reached</a>(const node &amp;n) const </td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#7d28afa62ce8068c4d0f2d1f96136fd6">reset</a>()</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#226308389f3c36dfc02768c09f777a3b">run</a>(graph &amp;G)</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#98cad540fd2d211c1ba44bb6fa8416f3">source</a>(const node &amp;n)</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#d0cf03b1e57fc0e96ce46f772519e5b2">source</a>() const </td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#ac87169a3cf4f95477ce215a0cb7a12b">store_preds</a>(bool set)</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#46385105a5c73d364cc92276ddd8daa1">store_preds</a>() const </td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#9e276cc9f30c2e608d320db4a08b2a74">weights</a>(const edge_map&lt; double &gt; &amp;weight)</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#dca9b1e7fa3afd914519a9dbb44e9fd5">~algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00002.html#8fce4fdf5ad4d7ee2355c08816cc4f67">~bellman_ford</a>()</td><td><a class="el" href="a00002.html">bellman_ford</a></td><td><code> [virtual]</code></td></tr>
</table>    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>
